The Banzhaf power index on convex geometries

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Banzhaf power index on convex geometries

In this paper, we introduce the Banzhaf power indices for simple games on convex geometries. We define the concept of swing for these structures, obtaining convex swings. The number of convex swings and the number of coalitions such that a player is an extreme point are the basic tools to define the convex Banzhaf indices, one normalized and other probabilistic. We obtain a family of axioms tha...

متن کامل

The Banzhaf power index for ternary bicooperative games

In this paper we analyze ternary bicooperative games, which are a refinement of the concept of a ternary voting game introduced by Felsenthal and Machover. Furthermore, majority voting rules based on the difference of votes are simple bicooperative games. First, we define the concepts of the defender and detractor swings for a player. Next, we introduce the Banzhaf power index and the normalize...

متن کامل

Probabilistic values on convex geometries

A game on a convex geometry is a real-valued function defined on the family L of the closed sets of a closure operator which satisfies the finite Minkowski-KreinMilman property. If L is the Boolean algebra 2 then we obtain an n-person cooperative game. We will extend the work of Weber on probabilistic values to games on convex geometries. As a result, we obtain a family of axioms that give rise...

متن کامل

The Shapley value on convex geometries

A game on a convex geometry is a real-valued function de0ned on the family L of the closed sets of a closure operator which satis0es the 0nite Minkowski–Krein–Milman property. If L is the boolean algebra 2 then we obtain an n-person cooperative game. Faigle and Kern investigated games where L is the distributive lattice of the order ideals of the poset of players. We obtain two classes of axiom...

متن کامل

The core of games on convex geometries

A game on a convex geometry is a real-valued function de®ned on the family L of the closed sets of a closure operator which satis®es the ®nite Minkowski±Krein±Milman property. If L is the Boolean algebra 2 N then we obtain a n-person cooperative game. We will introduce convex and quasi-convex games on convex geometries and we will study some properties of the core and the Weber set of these games.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Social Sciences

سال: 1998

ISSN: 0165-4896

DOI: 10.1016/s0165-4896(98)00021-3